Conditional Belief Functions: a Comparison among Different Definitions
نویسندگان
چکیده
By following the idea that a conditional measure is more than a sort of a rearrangement of an unconditional measure, we are interested in studying the controversial concept of conditional belief function as a generalized decomposable conditional measure, that is a suitable real function φ(·|·), defined on a family of conditional events, ruled by a set of axioms involved two composition rules ⊕ and ̄.
منابع مشابه
A Preferred Definition of Conditional Rényi Entropy
The Rényi entropy is a generalization of Shannon entropy to a one-parameter family of entropies. Tsallis entropy too is a generalization of Shannon entropy. The measure for Tsallis entropy is non-logarithmic. After the introduction of Shannon entropy , the conditional Shannon entropy was derived and its properties became known. Also, for Tsallis entropy, the conditional entropy was introduced a...
متن کاملEvidential Reasoning with Conditional Belief Functions
In the existing evidential networks with belief functions, the relations among the variables are always represented by joint belief functions on the product space of the involved variables. In this paper, we use conditional belief functions to represent such relations in the network and show some relations of these two kinds of representations. We also present a propagation algorithm for such n...
متن کاملEntrenchment of Knowledge Types 1 On the epistemic entrenchment of different types of knowledge expressed as conditionals in belief revision tasks
On the epistemic entrenchment of different types of knowledge expressed as conditionals in belief revision tasks Renée Elio Abstract Some belief revision theories appeal to the notion of epistemic entrenchment as a guide to choosing among alternative ways of removing inconsistency that new information may cause with existing beliefs. While belief revision theorists may not be interested in natu...
متن کاملA Comparison of Architectures for Exact Inference in Evidential Networks
This paper presents a comparison of two architectures for belief propagation in evidential networks, namely the binary join tree using joint belief functions [9] and the modified binary join tree using conditional belief functions [2]. This comparison is done from the perspective of graphical structure, messagepassing scheme, computational efficiency, storage efficiency, and complexity analysis...
متن کاملConditional lndependence in Uncertainty Theories
This paper introduces the notions of independence and conditional independence in valuation-based systems (VBS). VBS is an axiomatic framework capable of representing many different uncertainty calculi. We define independence and conditional independence in terms of factorization of the joint valuation. The definitions of independence and conditional independence in VBS generalize the correspon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006